Sharp, strong and unique minimizers for low complexity robust recovery
نویسندگان
چکیده
Abstract In this paper, we show the important roles of sharp minima and strong for robust recovery. We also obtain several characterizations convex regularized optimization problems. Our are quantitative verifiable especially case decomposable norm problems including sparsity, group-sparsity low-rank For problems, that a unique solution is obtains uniqueness.
منابع مشابه
A Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملSharp bounds for population recovery
The population recovery problem is a basic problem in noisy unsupervised learning that has attracted significant research attention in recent years [WY12, DRWY12, MS13, BIMP13, LZ15, DST16]. A number of different variants of this problem have been studied, often under assumptions on the unknown distribution (such as that it has restricted support size). In this work we study the sample complexi...
متن کاملContinuously Variable Bandwidth Sharp FIR Filters with Low Complexity
In software defined radio (SDR), sharp filters of different bandwidth are required to fine tune the desired channel. This requires different computational resources and large number of filter coefficients. This paper proposes a continuously variable bandwidth sharp finite impulse response (FIR) filter with low distortion and low complexity. For this, a fixed length FIR filter is used with two a...
متن کاملOnline Robust Low Rank Matrix Recovery
Low rank matrix recovery has shown its importance as a theoretic foundation in many areas of information processing. Its solutions are usually obtained in batch mode that requires to load all the data into memory during processing, and thus are hardly applicable on large scale data. Moreover, a fraction of data may be severely contaminated by outliers, which makes accurate recovery significantl...
متن کاملNew necessary conditions for Lipschitz strong local minimizers
We derive a set of new necessary conditions for Lipschitz strong local minimizers. These conditions restrict the behavoir of the L gradient of the minimizer at its discontinuities. We show by way of examples that the derived conditions are independent of one another.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Inference: A Journal of the IMA
سال: 2023
ISSN: ['2049-8772', '2049-8764']
DOI: https://doi.org/10.1093/imaiai/iaad005